Methods and systems for analysis, tracking and modifications of call options on debt issuances

ABSTRACT

A computer-implemented method that includes receiving on a computer system, a price of a debt issuance; where the price of the debt issuance includes a cost for purchase of an embedded call option; calculating on a computer system, an actual cost of the purchase of the embedded call option; comparing on a computer system, the cost calculation of the call option to a rule based system of an alternative option type and a corresponding cost of the alternative option type; and determining on a computer system, based on the comparing step, the type of option to be embedded with the debt issuance.

RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/305,697, filed Jun. 16, 2014, entitled “METHODS AND SYSTEMS FOR ANALYSIS, TRACKING AND MODIFICATIONS OF CALL OPTIONS ON DEBT ISSUANCES”, which is a continuation of U.S. patent application Ser. No. 13/525,143, filed Jun. 15, 2012, entitled “METHODS AND SYSTEMS FOR ANALYSIS, TRACKING AND MODIFICATIONS OF CALL OPTIONS ON DEBT ISSUANCES”, now U.S. Pat. No. 8,756,147, which claims the priority of provisional application Ser. No. 61/497,277, filed Jun. 15, 2011, entitled “METHODS AND SYSTEMS FOR ANALYSIS, TRACKING, AND MODIFICATIONS OF CALL OPTIONS ON MUNICIPAL BONDS,” all of which are incorporated herein by reference in their entirety for all purposes.

TECHNICAL FIELD

In some embodiments, the instant invention relates to methods and systems for purchasing call options on debt issuances. In some embodiments, the instant invention relates to computer methods and computer systems for the purchase of call options on municipal bonds.

BACKGROUND

Debt issuance call options are generally not “free”; they have a quantifiable cost separate and apart from the dollar price cost of the underlying bond being issued. Differently structured options have different costs, and different options have different likelihoods of being exercised over their life; as such, differently structured options can serve different purposes for issuers. These options can be consciously purchased, used and structured by issuers to achieve specific purposes.

SUMMARY OF INVENTION

In one embodiment, the present invention is a computer-implemented method that includes receiving on a computer system, a price of a debt issuance, wherein the price of the debt issuance includes a cost for purchase of an embedded call option.

In an embodiment, the present invention further includes calculating on a computer system, an actual cost of the purchase of the embedded call option; and comparing on a computer system, the cost calculation of the call option to a rule based system of an alternative option type and a corresponding cost of the alternative option type.

In an embodiment, the present invention further includes determining on a computer system, based on the comparing step, the type of option to be embedded with the debt issuance.

In some embodiments, the alternate option type includes at least one of a call option, a swaption, an interest rate option, a currency option, a commodity option, and a yield curve option. In some embodiments, the debt issuance is a municipal bond.

In other embodiments, the rule based system further includes a structure of the alternate option type and a corresponding cost of the structure of the option type.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be further explained with reference to the attached drawings, wherein like structures are referred to by like numerals throughout the several views. The drawings shown are not necessarily to scale, with emphasis instead generally being placed upon illustrating the principles of the present invention. Further, some features may be exaggerated to show details of particular components.

FIG. 1 illustrates certain features of some embodiments of the present invention.

FIGS. 2a-2k illustrate certain features of some further embodiments of the present invention.

FIGS. 3a-3b illustrate certain features of some further embodiments of the present invention.

FIGS. 4a-4b illustrate certain features of some further embodiments of the present invention.

FIGS. 5a-5b illustrates certain features of some further embodiments of the present invention.

FIG. 6 illustrates certain features of some further embodiments of the present invention.

FIGS. 7a-7f illustrate certain features of some further embodiments of the present invention.

FIGS. 8a-8m illustrate yet certain features of some further embodiments of the present invention.

FIG. 9 illustrates yet certain features of some further embodiments of the present invention.

FIG. 10 illustrates yet certain features of some further embodiments of the present invention.

FIG. 11 illustrates yet certain features of some further embodiments of the present invention.

The figures constitute a part of this specification and include illustrative embodiments of the present invention and illustrate various objects and features thereof. Further, the figures are not necessarily to scale, some features may be exaggerated to show details of particular components. In addition, any measurements, specifications and the like shown in the figures are intended to be illustrative, and not restrictive. Therefore, specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely as a representative basis for teaching one skilled in the art to variously employ the present invention.

DETAILED DESCRIPTION

Among those benefits and improvements that have been disclosed, other objects and advantages of this invention will become apparent from the following description taken in conjunction with the accompanying figures. Detailed embodiments of the present invention are disclosed herein; however, it is to be understood that the disclosed embodiments are merely illustrative of the invention that may be embodied in various forms. In addition, each of the examples given in connection with the various embodiments of the invention which are intended to be illustrative, and not restrictive.

Throughout the specification and claims, the following terms take the meanings explicitly associated herein, unless the context clearly dictates otherwise. The phrases “In some embodiments” and “in some embodiments” as used herein do not necessarily refer to the same embodiment(s), though it may. Furthermore, the phrases “in another embodiment” and “in some other embodiments” as used herein do not necessarily refer to a different embodiment, although it may. Thus, as described below, various embodiments of the invention may be readily combined, without departing from the scope or spirit of the invention.

In addition, as used herein, the term “or” is an inclusive “or” operator, and is equivalent to the term “and/or,” unless the context clearly dictates otherwise. The term “based on” is not exclusive and allows for being based on additional factors not described, unless the context clearly dictates otherwise. In addition, throughout the specification, the meaning of “a,” “an,” and “the” include plural references. The meaning of “in” includes “in” and “on.”

In some embodiments, the term “municipal bond” as used herein refers to a negotiable certificate that acknowledges the indebtedness of the bond issuer to the holder issued by a city or other local government, or their agencies.

In some embodiments, the term “call option” as used herein refers to a financial contract between two parties, the buyer and the seller. The buyer of the call option has the right, but not the obligation to buy an agreed quantity of a particular commodity or financial instrument from the seller of the call option at a certain time for a certain price.

In some embodiments, the term “hedging position” as used herein refers to an investment position intended to offset potential losses that may be incurred by a companion investment.

In some embodiments, the term “callable bonds” as used herein refers to a type of bond that allows the issuer of the bond to retain the privilege of redeeming the bond at some point before the bond reaches its date of maturity.

In some embodiments, the term “year par call” as used herein refers to the date at which an issuer can redeem part or all of a security prior to maturity.

In some embodiments, the term “swaptions” as used herein refers to an option granting its owner the right but not the obligation to enter into an underlying swap. In some embodiments, the term “swap” as used herein refers to a derivative in which counterparties exchange cash flows of one party's financial instrument for those of the other party's financial instrument.

In some embodiments, the term “make-whole call” as used herein refers to a type of call provision on a bond allowing the borrower to pay off remaining debt early.

In some embodiments, the term “noncallable” as used herein refers to a financial security that cannot be redeemed early by the issuer.

In some embodiments, the term “data” as used herein means any indicia, signals, marks, symbols, domains, symbol sets, representations, and any other physical form or forms representing information, whether permanent or temporary, whether visible, audible, acoustic, electric, magnetic, electromagnetic or otherwise manifested. In some embodiments, the term “data” as used to represent pre-determined information in one physical non-transient form shall be deemed to encompass any and all representations of corresponding information in a different physical form or forms.

In some embodiments, the term “presentation data” as used herein means data to be presented to a person in any perceptible form, including but not limited to, visual form and aural form. Examples of presentation data include data displayed on a visual presentation device, such as a PDA, a smart phone, a monitor, and data printed on paper.

In some embodiments, the term “presentation device” as used herein means a device or devices capable of presenting data to a person in any perceptible form.

In some embodiments, the term “database” as used herein means an organized body of related data, regardless of the manner in which the data or the organized body thereof is represented. For example, the organized body of related data may be in the form of one or more of a table, a map, a grid, a packet, a datagram, a frame, a file, an e-mail, a message, a document, a list or in any other suitable form.

In some embodiments, the term “image dataset” as used herein means a database suitable for use as presentation data or for use in producing presentation data.

In some embodiments, the term “auxiliary image feature” as used herein means one or more of the color, brightness, shading, shape or texture of an image.

In some embodiments, the term “network” as used herein includes both networks and internetworks of all kinds, including the Internet, and is not limited to any particular network or inter-network. For example, “network” includes those that are implemented using wired links, wireless links or any combination of wired and wireless links.

In some embodiments, the terms “first”, “second”, “primary” and “secondary” are used to distinguish one element, set, data, object, step, process, activity or thing from another, and are not used to designate relative position or arrangement in time, unless otherwise stated explicitly.

In some embodiments, the terms “coupled”, “coupled to”, “coupled with,” “connected”, and “connected with” as used herein each mean a relationship between or among two or more devices, apparatus, files, circuits, elements, functions, operations, processes, programs, media, components, networks, systems, subsystems, and/or means, constituting any one or more of (a) a connection, whether direct or through one or more other devices, apparatus, files, circuits, elements, functions, operations, processes, programs, media, components, networks, systems, subsystems, or means, (b) a communication relationship, whether direct or through one or more other devices, apparatus, files, circuits, elements, functions, operations, processes, programs, media, components, networks, systems, subsystems, or means, and/or (c) a functional relationship in which the operation of any one or more devices, apparatus, files, circuits, elements, functions, operations, processes, programs, media, components, networks, systems, subsystems, or means depends, in whole or in part, on the operation of any one or more others thereof.

In some embodiments, the terms “communicate,” “communicating” and “communication” as used herein include both conveying data from a source to a destination, and delivering data to a communication medium, system, channel, network, device, wire, cable, fiber, circuit and/or link to be conveyed to a destination. The term “communications” as used herein includes one or more of a communication medium, system, channel, network, device, wire, cable, fiber, circuit and link.

In some embodiments, the term “processor” as used herein means processing devices, apparatus, programs, circuits, components, systems and subsystems, whether implemented in hardware, software or both, and whether or not programmable. In some embodiments, the term “processor” as used herein includes, but is not limited to one or more computers, hardwired circuits, neural networks, signal modifying devices and systems, devices and machines for controlling systems, central processing units, programmable devices and systems, field programmable gate arrays, application specific integrated circuits, systems on a chip, systems comprised of discrete elements and/or circuits, state machines, virtual machines, data processors, processing facilities and combinations of any of the foregoing.

In some embodiments, the term “data processing system” as used herein means a system implemented at least in part by hardware and comprising a data input device, a data output device and a processor coupled with the data input device to receive data therefrom and coupled with the output device to provide processed data thereto.

In some embodiments, the terms “obtain”, “obtained” and “obtaining”, as used with respect to a processor or data processing system mean (a) producing data by processing data, (b) retrieving data from storage, or (c) requesting and receiving data from a further data processing system.

In some embodiments, the terms “storage” and “data storage” as used herein mean one or more data storage devices, apparatus, programs, circuits, components, systems, subsystems, locations and storage media serving to retain data, whether on a temporary or permanent basis, and to provide such retained data.

The present invention relates to debt issuances that include, but are not limited to, municipal bonds. Any reference to municipal or municipal bond is not limiting and may include other types of debt issuances. A municipal issuer's purchase of a call option on a debt issuance has a discrete, quantifiable cost. In one embodiment, a municipal bond issuer can incorporate an option purchase analysis element into its debt policy to help focus awareness on the cost and appropriate usage of call options. In one embodiment, elements of such a policy are described below.

Call Option Purchase Decisions

Debt issuance call options are generally not “free”; they have a quantifiable cost separate and apart from the dollar price cost of the underlying bond being issued. Differently structured options have different costs, and different options have different likelihoods of being exercised over their life; as such, differently structured options can serve different purposes for issuers and may be consciously purchased, used and structured by issuers to achieve specific purposes. In some embodiments, a municipal issuer can consider establishing a discrete component of its debt policy that sets forth its reasons or purposes for purchasing options in conjunction with its bond offerings in the new issue marketplace, and seek to define the type and/or characteristics of such option that best suits its purposes as well as the option cost it is willing to pay to achieve such goals. In some embodiments, although an issuer might execute its option strategies in conjunction with its debt issuance new issuances, it can develop an option management strategy and framework that is maintained independently of its bond offering activities.

In one embodiment, non-limiting, recommended rule based system for developing a strategic option management framework are described in the following paragraphs.

Rule Based System

Issuers may view their option purchases on a standalone basis and evaluate their overall optionality portfolio on a standalone basis;

Issuers may attempt to look at their combined overall liability (debt) and asset (investment) portfolio characteristics when making optionality purchase decisions on the debt/bond side of the balance sheet;

Issuers may seek to use option purchases as a tool in an overall strategy to “immunize” their overall combined asset/liability portfolio against changes in market interest rates. In another embodiment, an issuer can use option purchases as a tool for managing the impact that various econometric measures or economic activity are expected to have on the issuer's overall revenues or asset/liability portfolio and structure option purchases in a manner to generate offsetting benefits/risks accordingly;

Although new issue structuring and optionality purchases are closely tied elements of a debt issuance offering, an issuer may seek to the best extent possible to undertake an independent decision-making process with respect to option purchases at time of a bond offering, and may seek to make conscious and deliberate decisions regarding option purchases in conjunction with its bond offering process; and/or

Issuers may implement the rule based system to determine what portfolio management purposes or goals are being satisfied with the purchase of an option and whether the price and structure of the option being purchased meet the identified goals.

Market-Specific Guidelines

In some embodiments, when an issuer has established its rule based system for option management, the issuer can determine the type, structure and cost of the options available in the marketplace at time of marketing its debt issuances and make its option purchase decisions in a manner consistent with the non-limiting, recommended General Guidelines identified above. In some embodiments, specific steps involved in this process may include one or more of the following:

Determine the specific reason/goals for purchasing the option consistent with its rule based system. In some embodiments, these rule based system may include, but are not limited to, the following:

Creation of Hedging Positions—Determine whether or how the purchase of the option satisfies the hedging need of the issuer consistent with General Guideline #3 from above;

Creation of Value Positions—Confirm that the issuer believes that the price of the option represents a significant value (intrinsic or otherwise) at the time of purchase. In this case the issuer should also determine that the expenditures of capital budget moneys to purchase such “value” positions is consistent with the issuer's overall debt management or capital expenditure policies; and/or

Conformance With Market Realities—Determine that call options may realistically be purchased during periods where the municipal new issue market strongly prefers to purchase callable bonds at time of issuance, or that there is a significantly deeper or wider market for callable bonds, and/or that the issuer is unable to sell non-callable debt in the size, structure and maturities it is seeking to market bonds. The municipal new issue marketplace may include limitations on the amount and structure of noncallable debt that can be issued at reasonable prices and/or on the amount and structure of “unconventional” options (i.e. short call or par-coupon call options) that can be purchased at cost effective prices.

Seek ways to modify/tailor option structures (i.e. an 8 year par call versus a 10 year par call) so as to enhance the value of the option relative to its portfolio management goals from above and/or take advantage of relative value opportunities.

Compare the market-based cost of the call option with conventional hypothetical option valuation methodologies such as binomial tree to compare hypothetical option cost with actual option cost.

Develop the ability/methodology to use swaptions and other types of interest rate option products that are more actively and transparently traded as tools for assessing the value and relative value of the bond options being considered for purchase and/or as proxies or purchase alternatives to call options purchased in the municipal bond new issue market.

Seek ways to incorporate other types options (i.e. currency, commodity, and yield curve options, etc.) into its bond option component if these types of options are consistent with the issuer's General Guidelines and can be incorporated in a cost effective manner

Additionally, in some embodiments, an issuer can evaluate at option purchases by issuers across its entire portfolio (i.e. by the Massachusetts Water Pollution Abatement Trust (MWPAT) and the Massachusetts School Building Authority (MSBA) in addition to General Obligation (GO)), and seek to opportunistically manage its option portfolio and purchases on a holistic portfolio-wide basis in the most cost effective possible overall manner.

In one embodiment, strategic considerations for analyzing the cost of a call option include, but is not limited to, consideration of the cost of call option versus non-call or make-whole call; evaluation whether paying for interest rate optionality (versus at-market redemption option) is a necessary “capital” expenditure; and consideration of the purchase of the call in cash market with a resale and gain in.

The table shown in FIG. 1 is a non-limiting example of the call option cost analysis described above.

In one embodiment, a non-limiting example valuation analysis is shown in FIGS. 2A and 2B and the tables shown in FIGS. 2C to 2K. Another, non-limiting example of evaluating an option value is shown on FIG. 3A and the table shown on FIG. 3B. The table on FIG. 3B shows the internal rate of return (IRR) of the option purchase. Yet another non-limiting example of evaluating an option value is shown on FIG. 4A and table shown on FIG. 4B. The table on FIG. 4B shows the IRR of the option purchase.

In yet another, non-limiting example, a synthetic call option product that uses derivative applications may be used to simulate the economics of callable bonds. Historically, bond transactions have been structured to include the purchase of call options. Call options are “embedded” into the bond structure, effectively purchased directly from the bond investor, and are instrumental in allowing the issuer to take advantage of changes in future interest rate markets. Synthetic call options are designed to incorporate derivative applications. In an embodiment, the comparison between the synthetic call option product and the conventional bond market is shown in FIG. 5A. As shown in the figure, a conventional fixed rate bond call Jul. 1, 2018 at 100% corresponds to a the purchase of an embedded cell option which is economically equivalent to the purchase of a swap option to receive fixed and pay floating. Also shown in the figure is non-callable fixed rate bond and swaption purchase which corresponds with the purchase of a swaption to receive fixed and pay floating. FIG. 5B shows the historical call option valuation for a Series 2007 Term Bond 1.

In some embodiments, the synthetic call option position may be controlled independently of bond position. In some embodiments, the synthetic call option can be “exercised” at any time by selling in the open market. In an embodiment, the synthetic call option position can be liquidated at any time at market without restrictions and thus does not require implementation of a cumbersome advance refunding to unlock option savings.

In some embodiments, the synthetic call option position provides an ability to customize couponing, term, size and exercise date. In other embodiments, the synthetic call option may be structured as an “at the money” option versus the more expensive “in the money” option position found on embedded bond option. In an embodiment, the Issuer risks less capital in purchasing its option position. In some embodiments, the bonds may have a make-whole call for preservation of an restructuring option.

In yet another embodiment, the option position may be controlled independently of bond position. In an embodiment, the synthetic call option can be “exercised” at any time by selling in the open market. In an embodiment, the option position can be liquidated at any time at market without restrictions. In some embodiments, this option provides the ability to customize couponing, term, size and exercise date. In some embodiments, the option position may be structured as an “at the money” option versus the more expensive “in the money” option position found on embedded bond option. In some embodiments, the issuer risks less capital in purchasing its option position. In some embodiments, the bonds can have make-whole call for preservation of restructuring option.

Bond call options are frequently purchased by municipal bond issuers with only minimal analysis of the independent cost of the embedded option. The issuer generally evaluates only the aggregate price for the bond and the embedded option combined. In one embodiment, the independent cost of the option can be separately calculated by valuing the price of the bond with the call option stripped off (i.e. a non callable bond) and comparing this price with the price paid by the investor for the callable bond with the embedded option. In one embodiment, a system that includes, but is not limited to, calculation of the prices paid by issuers over time for their call option purchases. In an embodiment, the system also includes calculation and monitoring of the “market value” of the option positions over time. “Market value” is measured as the present value savings from a hypothetical refunding of the underlying bond with non callable debt. When an issuer undertakes a refunding with non callable bonds, it is effectively “re-selling” this option in the market. In an embodiment, municipal issuers may compare this “realized value” of option sales upon a refunding to a benchmark sale hurdle price (i.e. 3% savings). In some embodiments, the system creates an additional metric for gauging the viability both of owning options and re-selling options by calculating and monitoring the Return on Investment (“ROI”) of option purchases and re-sale.

In a non-limiting example, two recent advance refunding transactions (the 2006B and the 2006C Refundings) have been analyzed to determine the ROI of the option investments. In the example, certain assumptions for the refunding calculations to arrive at present value savings per maturity have been incorporated. The tables shown in FIG. 6 show the initial price paid for the options and compares that price with the value realized for the option upon refunding.

In the non-limiting example shown in the tables shown in FIG. 6 and described above, although the 2006B refunding produced present value savings close to or in excess of 3%, there were several maturities of the 2005C where ROI's were marginal or negative due to the high initial cost of the option. In some embodiments, option values and IRRs may be closely monitored for market opportunities such as the 2006C refunding produced and as a check on a conventional one dimensional present value savings refunding test. In some embodiments, short term gains after 30-40 basis point (bps) market changes that produce high IRR's may be considered for refundings. In other embodiments, the overall options strategy and policy may be guided potentially based on the answers to one or more of the following questions:

Are there alternative methods of achieving redemption flexibility other than purchasing interest rate optionality (i.e. make-whole calls)?;

Is the purchase of interest rate optionality an effective or appropriate usage of capital program funds?;

If a systematic purchase of interest rate option positions is the goal, should the issuer adopt a rule based system?

What are the alternative methods for purchasing interest rate optionality and are those methods more suitable?

As stated above, bond call options are frequently purchased by municipal bond issuers with minimal analysis of the independent cost of the embedded option. The issuer generally evaluates only the aggregate price for the bond and the embedded option combined. In one embodiment, the independent cost of the option can be separately calculated by valuing the price of the bond with the call option stripped off (i.e. a non callable bond) and comparing this price with the price paid by the investor for the callable bond with the embedded option. In one embodiment, a system that includes, but is not limited to, calculation of the prices paid by issuers over time for their call option purchases. In an embodiment, the system also includes calculation and monitoring of the “market value” of the option positions over time. “Market value” is measured as the present value savings from a hypothetical refunding of the underlying bond with non callable debt. When an issuer undertakes a refunding with non callable bonds, it is effectively “re-selling” this option in the market. In an embodiment, municipal issuers may compare this “realized value” of option sales upon a refunding to a benchmark sale hurdle price (i.e. 3% savings). In some embodiments, the system creates an additional metric for gauging the viability both of owning options and re-selling options by calculating and monitoring the Return on Investment (“ROI”) of option purchases and re-sale.

In a non-limiting example, the value of historical call options has been analyzed. The results of the analysis is shown on FIGS. 7A-7F. Option values and IRRs may be monitored closely for market opportunities. Short term gains after 30 to 40 bps market changes that produce high IRR's may be considered for refundings. Similar to the example above, the overall options strategy and policy may be guided potentially based on the answers to one or more of the following questions:

Are there alternative methods of achieving redemption flexibility other than purchasing interest rate optionality (i.e. make-whole calls)?;

Is the purchase of interest rate optionality an effective or appropriate usage of capital program funds?;

If a systematic purchase of interest rate option positions is the goal, should the issuer adopt a rule based system?

What are the alternative methods for purchasing interest rate optionality and are those methods more suitable?

In other non-limiting examples, evaluations of the ROIs associated with various Series options are shown in the tables shown in FIGS. 8A-8M.

In non-limiting examples of the present invention, the rule based system is exemplified. Specifically, examples of the underlying ROI calculations associated with the present invention are provided. These non-limiting examples include a description of the process of an embodiment of the present invention. Data include with these example is presented in the tables shown in FIG. 9.

In an example, each refunding candidate includes a series description, the maturity date of the associated bonds, the coupon rate, the par amount, the call date and the call price. Based on the information and additional information from one or more remote databases, the data results are calculated which may include, but is not limited to the Option Price at Issue, the Option Value currently, the gain/losses between these two values and the ROI. For the ROI, an interest rate is calculated that discounts the Option Exercise Value Currently to the Option Price at Issue at the time of issuance. In this example, the interest rate is calculated based on a user-defined function to be used in a spreadsheet program such as MS Excel® or equivalent. In this example, the calculation iterates until the correct rate is calculated.

In this example, the Option Value Currently is first calculated. The value is calculated as the net present value savings of refunding the refunding candidate today. Based on the user inputs, the present invention incorporates the current market yield for new refunding bonds, the escrow reinvestment rate, the coupon for the new refunding bonds, and the call date or final maturity for the refunding bonds. In this example, from these inputs and based on an initial description of the bonds, the net present value refunding savings can be calculated via a user-defined function to be used in a spreadsheet program such as MS Excel®. The first half of the gain/loss calculation is completed based on this calculation.

For the second half of the gain/loss calculation, the historical index information and pricing information related to the candidates is evaluated. From the inputs, the number of 30/360 years between the Sale Date and the Maturity Date of bonds is calculated. Based on the number of years calculated, the equivalent Municipal Market Data (MMD) index rate for that maturity and its Non-Callable MMD index rate for that day are used to calculate the difference in yield prevailing in the market that day for issuance of non-callable bonds compared with callable bonds. Alternate index rates other than the MMD index rate may be used. In some embodiments, the index rates will be based on an internal database of historical market prices.

In this example, based on the original yield input and the Original NC Difference, the Calculated NC Yield can be calculated. With both the original yield and the Calculated NC Yield, the Original Price and the Calculated NC Price can be calculated based on, for example, the PRICE function in a spreadsheet program such as MS Excel®. By subtracting the Original Price from the Calculated NC Price, the Option Price at Issue can be calculated. The example shown on FIG. 9 is based on a $100 bond.

Next, the Option Price at Issue can be subtracted from the Option Price Currently to calculate the Gain/(Loss). In some embodiments, if either the Option Price at Issue or the Option Value Currently is less than zero, the model will replace these values with zero. The MS Excel® or equivalent User-Defined Function may then calculate the rate required to discount the Option Exercise Value Currently (as of today) to the Option Price at Issue (as of the delivery date of the bonds). This value is the rate of return on investment for going long municipal bond call option.

By looking back to market conditions from the sale date of refunding candidates and calculating an original option price based on the differential between the callable and non-callable MMD curves, the original call option price can then be calculated. Based on the original option price, the percentage return on investment for the candidate can then be calculated.

The User-Defined Functions referenced above are discussed in further detail below:

Non-limiting example of User-Defined Function 1: ROI( )—this function has three inputs: PresentCashflow, FutureCashflow and Periods. The function may begin with an initial guess of an interest rate 50% then calculates the future value (named GuessResult1) based on the initial rate assumption and number of periods. The function then performs this calculation again with a second guess of an interest rate of 100% for a future value identified as GuessResult2. With both GuessResult1 and GuessResult2, the model uses the following formula to calculate a third guess: Guess3=Guess2+(Guess1−Guess2)/(GuessResult1−GuessResult2)*(TargetValue−GuessResult2). The Target Value is the FutureValue input. This process continues until the “guess” is, within a degree of accuracy, correct. Additional information related to an example of the User-Defined Function 1 is shown below.

Function ROI(PresentCashflow As Double, FutureCashFlow As Double, Periods As Integer)

Non-limiting example of User-Defined Function 2: SavingsByMat ( )—This function may include up to twelve inputs: Settlement Date, Maturity Date, Call Date, Call Price, Par Amount, Coupon, Cost of Issuance, Refunding Yield, Refunding Coupon, Escrow Yield, Refunding Call Date and Refunding Last Maturity. Based on the Settlement Date, Call Date, Coupon and Escrow Yield, the function creates an escrow requirement table to calculate the necessary escrow deposit. Using the Settlement Date, Maturity Date and Coupon a refunded debt service schedule is then created. Then based on the cost of issuance input and the necessary escrow deposit along with the Refunding Yield, Refunding Coupon, Refunding Call Date and Refunding Last Maturity, the refunding bonds are sized. Once the refunding bonds are sized, the new refunding debt service schedule is calculated which is then compared with the refunded debt service schedule. These two schedules are then netted from each other and present valued to the settlement date for the present value savings. Additional information related to an example of the User-Defined Function 2 is shown below.

Public Function SavingsByMat(Settlement As Date, Maturity As Date, CallDate As Date, Coupon As Double, CallPrice As Double, ParAmount As Double, EscrowYield As Double, CostofIssuance As Double, RefundingYield As Double, RefundingCoupon As Double, RefundingCallDate As Date, RefundingLastMaturity As Date)

     Dim Table( ) As Variant      Dim Table2( ) As Variant      Dim EscrowTable( ) As Variant      Dim NPeriods As Integer      Dim NPeriods2 As Integer      Dim EscrowNPeriods As Integer      Dim FirstDate As Date      Dim FirstDate2 As Date      Dim CurrentDate As Date      Dim CurrentDate2 As Date      Dim EscrowCurrentDate As Date      Dim EscrowCost As Double      Dim COI As Double      Dim ProceedsNeeded As Double      Dim RefundingBondPrice As Double      Dim RefundingPar As Double      Dim PVOld As Double      Dim PVNew As Double      RefundingLastMaturity Application.WorksheetFunction.Min(DateSerial(Year(Maturity), Month(RefundingLastMaturity), Day(RefundingLastMaturity)), RefundingLastMaturity)       ‘Determine Number of Periods      If Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(Maturity), Day(Maturity)), −6) < Settlement Then       If DateSerial(Year(Settlement), Month(Maturity), Day(Maturity)) < Settlement Then        If Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(Maturity), Day(Maturity)), 6) < Settlement Then         FirstDate = Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(Maturity), Day(Maturity)), 12)        Else         FirstDate = Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(Maturity), Day(Maturity)), 6)        End If       Else        FirstDate = DateSerial(Year(Settlement), Month(Maturity), Day(Maturity))       End If      Else       FirstDate = Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(Maturity), Day(Maturity)), −6)      End If      NPeriods = 1      CurrentDate = FirstDate      Do Until CurrentDate = Maturity       NPeriods = NPeriods + 1       CurrentDate = Application.WorksheetFunction.EDate(CurrentDate, 6)      Loop      ‘Determine Number of Periods      If Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(RefundingLastMaturity), Day(RefundingLastMaturity)), −6) < Settlement Then       If DateSerial(Year(Settlement), Month(RefundingLastMaturity), Day(RefundingLastMaturity)) < Settlement Then        If Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(RefundingLastMaturity), Day(RefundingLastMaturity)), 6) < Settlement Then         FirstDate2 = Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(RefundingLastMaturity), Day(RefundingLastMaturity)), 12)        Else         FirstDate2 = Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(RefundingLastMaturity), Day(RefundingLastMaturity)), 6)        End If       Else        FirstDate2 = DateSerial(Year(Settlement), Month(RefundingLastMaturity), Day(RefundingLastMaturity))       End If      Else       FirstDate2 = Application.WorksheetFunction.EDate(DateSerial(Year(Settlement), Month(RefundingLastMaturity), Day(RefundingLastMaturity)), −6)      End If      NPeriods2 = 1      CurrentDate2 = FirstDate2      Do Until CurrentDate2 = RefundingLastMaturity       NPeriods2 = NPeriods2 + 1       CurrentDate2 = Application.WorksheetFunction.EDate(CurrentDate2, 6)      Loop      If RefundingLastMaturity > RefundingCallDate Then       If RefundingCoupon > RefundingYield Then        RefundingBondPrice = Application.WorksheetFunction.Price(Settlement, RefundingCallDate, RefundingCoupon, RefundingYield, 100, 2)       ElseIf RefundingCoupon = RefundingYield Then        RefundingBondPrice = 100       Else        RefundingBondPrice = Application.WorksheetFunction.Price(Settlement, RefundingLastMaturity, RefundingCoupon, RefundingYield, 100, 2)       End If      Else       RefundingBondPrice = Application.WorksheetFunction.Price(Settlement, RefundingLastMaturity, RefundingCoupon, RefundingYield, 100, 2)      End If      If CallDate < FirstDate Then       EscrowCost = (((Application.WorksheetFunction.Days360(Application.WorksheetFunction.EDate(FirstDate, −6), CallDate) / 180) * (ParAmount * Coupon / 2)) + (ParAmount * CallPrice / 100)) / (1 + EscrowYield)      Else       EscrowNPeriods = 1       EscrowCurrentDate = FirstDate       Do Until EscrowCurrentDate = CallDate        EscrowNPeriods = EscrowNPeriods + 1        EscrowCurrentDate = Application.WorksheetFunction.EDate(EscrowCurrentDate, 6)       Loop       ReDim EscrowTable(1 To EscrowNPeriods + 1, 1 To 6)       For X = 1 To UBound(EscrowTable)        If X = 1 Then         EscrowTable(X, 1) = Settlement        ElseIf X = 2 Then         EscrowTable(X, 1) = FirstDate        Else         EscrowTable(X, 1) = Application.WorksheetFunction.EDate(EscrowTable(X − 1, 1), 6)        End If       Next X       For X = 1 To UBound(EscrowTable)        EscrowTable(X, 2) = Application.WorksheetFunction.Days360(EscrowTable(1, 1), EscrowTable(X, 1)) / 180       Next X       For X = 2 To UBound(EscrowTable)        If X = (EscrowNPeriods + 1) Then         EscrowTable(X, 3) = ParAmount        Else         EscrowTable(X, 3) = 0        End If       Next X       For X = 2 To UBound(EscrowTable)        EscrowTable(X, 4) = ParAmount * Coupon / 2       Next X       For X = 2 To UBound(EscrowTable)        If X = (EscrowNPeriods + 1) Then         EscrowTable(X, 5) = EscrowTable(X, 3) + EscrowTable(X, 4) + (ParAmount * ((CallPrice / 100) − 1))        Else         EscrowTable(X, 5) = EscrowTable(X, 3) + EscrowTable(X, 4)        End If       Next X       For X = 2 To UBound(EscrowTable)        EscrowTable(X, 6) = EscrowTable(X, 5) * ((1 + (EscrowYield / 2)) {circumflex over ( )} − EscrowTable(X, 2))       Next X       For X = 2 To UBound(EscrowTable)        EscrowCost = EscrowCost + EscrowTable(X, 6)       Next X      End If      COI = ((EscrowCost / (RefundingBondPrice / 100)) / (1 − CostofIssuance)) − (EscrowCost / (RefundingBondPrice / 100))      ProceedsNeeded = EscrowCost + COI      RefundingPar = ProceedsNeeded / (RefundingBondPrice / 100)      ReDim Table(1 To NPeriods + 1, 1 To 6)      ReDim Table2(1 To NPeriods2 + 1, 1 To 6)      For X = 1 To UBound(Table)       If X = 1 Then        Table(X, 1) = Settlement       ElseIf X = 2 Then        Table(X, 1) = FirstDate       Else        Table(X, 1) = Application.WorksheetFunction.EDate(Table(X − 1, 1), 6)       End If      Next X      For X = 1 To UBound(Table)       Table(X, 2) = Application.WorksheetFunction.Days360(Table(1, 1), Table(X, 1)) / 180      Next X      For X = 2 To UBound(Table)       If X = (NPeriods + 1) Then        Table(X, 3) = ParAmount       Else        Table(X, 3) = 0       End If      Next X      For X = 2 To UBound(Table)        Table(X, 4) = ParAmount * Coupon / 2      Next X      For X = 2 To UBound(Table)        Table(X, 5) = Table(X, 3) + Table(X, 4)      Next X      For X = 2 To UBound(Table)       Table(X, 6) = Table(X, 5) * ((1 + (RefundingYield / 2)) {circumflex over ( )} −Table(X, 2))      Next X      For X = 2 To UBound(Table)       PVOld = PVOld + Table(X, 6)      Next X      For X = 1 To UBound(Table2)       If X = 1 Then        Table2(X, 1) = Settlement       ElseIf X = 2 Then        Table2(X, 1) = FirstDate2       Else        Table2(X, 1) = Application.WorksheetFunction.EDate(Table2(X − 1, 1), 6)       End If      Next X      For X = 1 To UBound(Table2)       Table2(X, 2) = Application.WorksheetFunction.Days360(Table2(1, 1), Table2(X, 1)) / 180      Next X      For X = 2 To UBound(Table2)       If CDate(Table2(X, 1)) = RefundingLastMaturity Then        Table2(X, 3) = RefundingPar       Else        Table2(X, 3) = 0       End If      Next X      For X = 2 To UBound(Table2)       If X = 2 Then        Table2(X, 4) = RefundingPar * (RefundingCoupon / 2) * Table2(2, 2)       ElseIf Table2(X, 1) = RefundingLastMaturity Then        Table2(X, 4) = (RefundingPar * RefundingCoupon / 2)       ElseIf Table2(X, 1) < RefundingLastMaturity Then        Table2(X, 4) = RefundingPar * (RefundingCoupon / 2)       Else        Table(X, 4) = 0       End If      Next X      For X = 2 To UBound(Table2)        Table2(X, 5) = Table2(X, 4) + Table2(X, 3)      Next X      For X = 2 To UBound(Table2)       Table2(X, 6) = Table2(X, 5) * ((1 + (RefundingYield / 2)) {circumflex over ( )} −Table2(X, 2))      Next X      For X = 2 To UBound(Table2)       PVNew = PVNew + Table2(X, 6)      Next X      SavingsByMat = PVOld − PVNew     End Function

EXAMPLES OF ILLUSTRATIVE OPERATING ENVIRONMENTS Examples of FIG. 10

FIG. 10 illustrates one embodiment of an environment in which the present invention may operate. However, not all of these components may be required to practice the invention, and variations in the arrangement and type of the components may be made without departing from the spirit or scope of the invention. In some embodiments, the instant invention can host a large number of persons and concurrent transactions. In other embodiments, the instant invention can be based on a scalable computer and network architecture that incorporates varies strategies for assessing the data, caching, searching, and database connection pooling. An example of the scalable architecture is an architecture that is capable of operating multiple servers.

In embodiments, persons' computer devices 102-104 include virtually any computing device capable of receiving and sending a message over a network, such as network 105, to and from another computing device, such as servers 106 and 107, each other, and the like. In embodiments, the set of such devices includes devices that typically connect using a wired communications medium such as personal computers, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, and the like. In embodiments, the set of such devices also includes devices that typically connect using a wireless communications medium such as cell phones, smart phones, pagers, walkie talkies, radio frequency (RF) devices, infrared (IR) devices, CBs, integrated devices combining one or more of the preceding devices, or virtually any mobile device, and the like. Similarly, in embodiments, persons' computer devices 102-104 are any device that is capable of connecting using a wired or wireless communication medium such as a PDA, POCKET PC, wearable computer, and any other device that is equipped to communicate over a wired and/or wireless communication medium.

In some embodiments, each person computer device within client devices 102-104 can include a browser application that is configured to receive and to send web pages, and the like. In embodiments, the browser application is configured to receive and display graphics, text, multimedia, and the like, employing virtually any web based language, including, but not limited to Standard Generalized Markup Language (SMGL), such as HyperText Markup Language (HTML), a wireless application protocol (WAP), a Handheld Device Markup Language (HDML), such as Wireless Markup Language (WML), WMLScript, JavaScript, and the like. In embodiments, persons' computer devices 102-104 can be programmed in either Java or .Net.

In some embodiments, persons' computer devices 102-104 are further configured to receive a message from the another computing device employing another mechanism, including, but not limited to email, Short Message Service (SMS), Multimedia Message Service (MMS), instant messaging (IM), internet relay chat (IRC), mIRC, Jabber, and the like.

In some embodiments, network 105 is configured to couple one computing device to another computing device to enable them to communicate. In embodiments, network 105 is enabled to employ any form of computer readable media for communicating information from one electronic device to another. Also, in embodiments, network 105 includes a wireless interface, and/or a wired interface, such as the Internet, in addition to local area networks (LANs), wide area networks (WANs), direct connections, such as through a universal serial bus (USB) port, other forms of computer-readable media, or any combination thereof. In embodiments, on an interconnected set of LANs, including those based on differing architectures and protocols, a router acts as a link between LANs, enabling messages to be sent from one to another.

Also, in some embodiments, communication links within LANs typically include twisted wire pair or coaxial cable, while communication links between networks may utilize analog telephone lines, full or fractional dedicated digital lines including T1, T2, T3, and T4, Integrated Services Digital Networks (ISDNs), Digital Subscriber Lines (DSLs), wireless links including satellite links, or other communications links known to those skilled in the art. Furthermore, in embodiments, remote computers and other related electronic devices could be remotely connected to either LANs or WANs via a modem and temporary telephone link. In essence, in embodiments, network 105 includes any communication method by which information may travel between client devices 102-104, and servers 106 and 107.

Examples of FIG. 11

FIG. 11 shows the computer and network architecture of some embodiments of the instant invention. The persons' computer devices 202 a, 202 b thru 202 n shown, each comprises a computer-readable medium, such as a random access memory (RAM) 208 coupled to a processor 210. The processor 210 executes computer-executable program instructions stored in memory 208. Such processors comprise a microprocessor, an ASIC, and state machines. Such processors comprise, or are be in communication with, media, for example computer-readable media, which stores instructions that, when executed by the processor, cause the processor to perform the steps described herein. Embodiments of computer-readable media include, but are not limited to, an electronic, optical, magnetic, or other storage or transmission device capable of providing a processor, such as the processor 210 of client 202 a, with computer-readable instructions. Other examples of suitable media include, but are not limited to, a floppy disk, CD-ROM, DVD, magnetic disk, memory chip, ROM, RAM, an ASIC, a configured processor, all optical media, all magnetic tape or other magnetic media, or any other medium from which a computer processor can read instructions. Also, various other forms of computer-readable media transmit or carry instructions to a computer, including a router, private or public network, or other transmission device or channel, both wired and wireless. The instructions comprise code from any computer-programming language, including, for example, C, C++, C#, Visual Basic, Java, Python, Perl, and JavaScript.

The persons' computer devices 202 a-n can also comprise a number of external or internal devices such as a mouse, a CD-ROM, DVD, a keyboard, a display, or other input or output devices. Examples of persons' computer devices 202 a-n are personal computers, digital assistants, personal digital assistants, cellular phones, mobile phones, smart phones, pagers, digital tablets, laptop computers, Internet appliances, and other processor-based devices. In general, a person device 202 a are be any type of processor-based platform that is connected to a network 206 and that interacts with one or more application programs. The persons' computer devices 202 a-n operate on any operating system capable of supporting a browser or browser-enabled application, such as Microsoft™, Windows™, or Linux. The persons' computer devices 202 a-n shown include, for example, personal computers executing a browser application program such as Microsoft Corporation's Internet Explorer™, Apple Computer, Inc.'s Safari™, Mozilla Firefox, and Opera.

Through the persons' computer devices 202 a-n, persons 212 a-n of the instant invention can communicate over the network 206 with a centralized computer system, and/or each other, and/or with other systems and devices coupled to the network 206. As shown in FIG. 3, server devices 204 and 213 are also coupled to the network 206.

In some embodiments, the instant invention can utilize NFC technology to obtain/transmit information. In some embodiments, NFC can represent a short-range wireless communications technology in which NFC-enabled devices are “swiped,” “bumped,” “tap” or otherwise moved in close proximity to communicate. In some embodiments, NFC could include a set of short-range wireless technologies, typically requiring a distance of 10 cm or less. In some embodiment, NFC can operates at 13.56 MHz on ISO/IEC 18000-3 air interface and at rates ranging from 106 kbit/s to 424 kbit/s. In some embodiments, NFC can involve an initiator and a target; the initiator actively generates an RF field that can power a passive target. In some embodiment, this can enable NFC targets to take very simple form factors such as tags, stickers, key fobs, or cards that do not require batteries. In some embodiments, NFC peer-to-peer communication can be conducted when a plurality of NFC-enable device within close proximity of each other.

In some embodiments, NFC tags can contain data and be read-only or rewriteable. In some embodiment, NFC tags can be custom-encoded. In some embodiments, NFC tags and/or NFC-enabled device (e.g., smart phones with NFC capabilities) can securely store personal data such as debit and credit card information, loyalty program data, PINs and networking contacts, and/or other information. NFC tags can be encoded to pass a Uniform Resource Locator (URL) and a processor of the NFC-enabled device can automatically direct a browser application thereof to the URL without prompting for permission to proceed to the designated location.

In some embodiments, lottery data may also be communicated using any wireless means of communication, such as 4G, 3G, GSM, GPRS, WiFi, WiMax, and other remote local or remote wireless communication using information obtained via the interfacing of a wireless NFC enabled mobile device to another NFC enabled device or a NFC tag. In some embodiments, the term “wireless communications” includes communications conducted at ISO 14443 and ISO 18092 interfaces. In some embodiments, the communications between person's NFC-enabled smart device and lottery provided equipment (e.g., terminals, POS, POE, Hosts) is performed, for example, in accordance with the ISO 14443A/B standard and/or the ISO 18092 standard.

In some embodiments, player's NFC-enabled smart device and/or lottery provided equipment (e.g., terminals, POS, POE, Hosts) can include one or more additional transceivers (e.g., radio, Bluetooth, and/or WiFi transceivers) and associated antennas, and enabled to communicate with each other by way of one or more mobile and/or wireless protocols. In some embodiments, NFC tags can include one or more integrated circuits.

In some embodiments, person's NFC-enabled smart device may include a cellular transceiver coupled to the processor and receiving a cellular network timing signal. In some embodiments, person's NFC-enabled smart device may further include a satellite positioning receiver coupled to the processor and receiving a satellite positioning system timing signal, and the processor may accordingly be configured to synchronize the internal timing signal to the satellite positioning system timing signal as the external timing signal. In some embodiments, the processor of person's NFC-enabled smart device may be configured to synchronize the internal timing signal to the common external system timing signal via the NFC circuit.

While a number of embodiments of the present invention have been described, it is understood that these embodiments are illustrative only, and not restrictive, and that many modifications may become apparent to those of ordinary skill in the art. 

What is claimed is:
 1. A computer-implemented method comprising: receiving on a computer system, a price of a debt issuance; wherein the price of the debt issuance includes a cost for purchase of an embedded call option; calculating on a computer system, an actual cost of the purchase of the embedded call option; comparing on a computer system, the cost calculation of the call option to a rule based system of an alternative option type and a corresponding cost of the alternative option type; and determining on a computer system, based on the comparing step, the type of option to be embedded with the debt issuance.
 2. The computer-implemented method of claim 1, wherein the alternate option type comprises at least one of the following i) call option ii) swaption iii) interest rate option iv) currency option v) commodity option vi) yield curve option
 3. The computer-implemented method of claim 1, wherein the debt issuance is a municipal bond.
 4. The computer-implemented method of claim 1, wherein the rule based system further comprises a structure of the alternate option type and a corresponding cost of the structure of the option type. 